Process Goose Queue Methodologies with Applications in Plant-wide Process Optimization

نویسندگان

  • Jingwen Huang
  • Hongguang Li
چکیده

Inspired by biologic nature of flying wild geese, a so-called process goose queue (PGQ) technique oriented for plant-wide optimization is established. Taking advantage of this ad-hoc structure of flying geese, a plant-wide process can be decomposed into several hierarchically connected PGQs along the direction of the objective function generation. In line with this thought, plant-wide process optimization is accordingly identical with the following and tracking issues between leading and following geese. Followed by this philosophy, related theoretical definitions and modeling principles together with enabling algorithms are explicitly introduced. With the characteristics of evolutionary optimization, PGQ approach is able to overcome the algorithmic deficiencies associated with conventional optimizations. To demonstrate the feasibility and validity of the contributions, TE process is employed as the case study.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of Control System of Petroleum Refinery Isomerization Unit by Plant-Wide Control Principles

Industrial process control system due to integration of equipment, existing material and energy recycle streams and their effects are extraordinary importance. The process in terms of safety, product quality and control stability have a challenge when there was defects in a process control system. The isomerization process is gaining importance in the presence of refining context due to upgradi...

متن کامل

DISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY

This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

متن کامل

Using Markov Chain to Analyze Production Lines Systems with Layout Constraints

There are some problems with estimating the time required for the manufacturing process of products, especially when there is a variable serving time, like control stage. These problems will cause overestimation of process time. Layout constraints, reworking constraints and inflexible product schedule in multi product lines need a precise planning to reduce volume in particular situation of lin...

متن کامل

Prioritize the ordering of URL queue in Focused crawler

The enormous growth of the World Wide Web in recent years has made it necessary to perform resource discovery efficiently. For a crawler it is not an simple task to download the domain specific web pages. This unfocused approach often shows undesired results. Therefore, several new ideas have been proposed, among them a key technique is focused crawling which is able to crawl particular topical...

متن کامل

A Study on State Dependent Accessible and Second Optional Service Queue with Impatient and Feedback Customers

In this paper, we study a single server Markovian queue with state dependent accessible services, reneging and feedback of customers. The server can accommodate at the most $d$ customers in the service station, after which the new arrivals have to wait in the primary queue of infinite waiting space. All arrivals demand First Essential Service (FES), after completing FES, customers decide to joi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JCP

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2012